منابع مشابه
Model Checking Mobile Processes
We introduce a temporal logic for the polyadic -calculus based on xed point extensions of Hennessy-Milner logic. Features are added to account for parametrisation, generation, and passing of names, including the use, following Milner, of dependent sum and product to account for (unlocalised) input and output, and explicit parametrisation on names using lambda-abstraction and application. The la...
متن کاملA Predicate Spatial Logic and Model Checking for Mobile Processes
1 Invited Talks 2 1.1 Software Services: Scientific Challenge or Industrial Hype? José Luiz Fiadeiro . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3 1.2 Integrating Variants of DC He Jifeng . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 4 1.3 A Predicate Spatial Logic and Model Checking for Mobile Processes Huimin Lin . . . . . . . . . . ...
متن کاملModel Checking PA-Processes
PA (Process algebra) is the name that has become common use to denote the algebra with a sequential and parallel operator (without communication), plus recursion. PA-processes subsume both Basic Parallel Processes (BPP) Chr93] and context-free processes (BPA). They are a simple model for innnite state concurrent systems. We show that the model checking problem for the branching time temporal lo...
متن کاملModel checking mobile ambients
We settle the complexity bounds of the model checking problem for the ambient calculus with public names against the ambient logic. We show that if either the calculus contains replication or the logic contains the guarantee operator, the problem is undecidable. In the case of the replication-free calculus and guarantee-free logic we prove that the problem is PSPACE-complete. For the complexity...
متن کاملModel-checking processes with data
We propose a procedure for automatically verifying properties (expressed in an extension of the modal μ-calculus) over processes with data, specified in μCRL. We first briefly review existing work, such as the theory of μCRL and we discuss the logic, called first order modal μ-calculus in more detail. Then, we introduce the formalism of first order boolean equation systems and focus on several ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Computation
سال: 1996
ISSN: 0890-5401
DOI: 10.1006/inco.1996.0072